On multi-criteria chance-constrained capacitated single-source discrete facility location problems
نویسندگان
چکیده
منابع مشابه
Efficient Heuristics for Single-source Capacitated Multi- Facility Weber Problems
In this paper, a single-source capacitated multifacility location problem with rectilinear distance under unbalanced transportation constraints is studied. The problem is formulated as a mixed integer linear programming problem of which the objective function is the sum of nonlinear functions. An algorithm under decomposition approach combining with logic based techniques is developed. Using th...
متن کاملUncapacitated and Capacitated Facility Location Problems
The uncapacitated facility location problem ( UFLP) involves locating an undetermined number of facilities to minimize the sum of the (annualized) fixed setup costs and the variable costs of serving the market demand from these facilities. UFLP is also known as the “simple” facility location problem SFLP, where both the alternative facility locations and the customer zones are considered discre...
متن کاملA Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
This paper presents a very large scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. The neighborhood structures are induced by customer multi-exchanges and by facility moves. We consider both single-customer multi-exchanges, detected on a suitably de ned customer improvement graph, and multi-customer multi-exchanges, detected...
متن کاملCapacitated facility location/network design problems
We introduce a combined facility location/network design problem in which facilities have constraining capacities on the amount of demand they can serve. This model has a number of applications in regional planning, distribution, telecommunications, energy management, and other areas. Our model includes the classical capacitated facility location problem (CFLP) on a network as a special case. W...
متن کاملComparison of Exact Algorithms for Rectilinear Distance Single-Source Capacitated Multi-Facility Weber Problems
Problem statement: The objective of this study is to develop efficient exact algorithms for a single source capacitated multi-facility location problem with rectilinear distance. This problem is concerned with locating m capacitated facilities in the two dimensional plane to satisfy the demand of n customers with minimum total transportation cost which is proportional to the rectilinear distanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Omega
سال: 2019
ISSN: 0305-0483
DOI: 10.1016/j.omega.2018.02.007